Solutions for Two Conjectures on the Inverse Problem of the Wiener Index of Peptoids
نویسندگان
چکیده
In this paper, we give solutions for the two conjectures on the inverse problem of the Wiener index of peptoids proposed by Goldman et al. We give the first conjecture a positive proof and the second conjecture a negative answer.
منابع مشابه
Analytic solutions for the Stephen's inverse problem with local boundary conditions including Elliptic and hyperbolic equations
In this paper, two inverse problems of Stephen kind with local (Dirichlet) boundary conditions are investigated. In the first problem only a part of boundary is unknown and in the second problem, the whole of boundary is unknown. For the both of problems, at first, analytic expressions for unknown boundary are presented, then by using these analytic expressions for unknown boundaries and bounda...
متن کاملSolution of Inverse Kinematic Problem of a 2DOF Robot Using Decomposition Method
The inverse kinematics problem of a two degree of freedom (2DOF) planar robot arms issolved using Adomian’s decomposition method (ADM), after converting to a system of twononlinear algebraic equations. The advantage of the method is that it gives the solutions asfunctions of the desired position of the end effecter and the length of the arms. The accuracyof the solutions can be increased up to ...
متن کاملMORE ON EDGE HYPER WIENER INDEX OF GRAPHS
Let G=(V(G),E(G)) be a simple connected graph with vertex set V(G) and edge set E(G). The (first) edge-hyper Wiener index of the graph G is defined as: $$WW_{e}(G)=sum_{{f,g}subseteq E(G)}(d_{e}(f,g|G)+d_{e}^{2}(f,g|G))=frac{1}{2}sum_{fin E(G)}(d_{e}(f|G)+d^{2}_{e}(f|G)),$$ where de(f,g|G) denotes the distance between the edges f=xy and g=uv in E(G) and de(f|G)=∑g€(G)de(f,g|G). In thi...
متن کاملA numerical Algorithm Based on Chebyshev Polynomials for Solving some Inverse Source Problems
In this paper, two inverse problems of determining an unknown source term in a parabolic equation are considered. First, the unknown source term is estimated in the form of a combination of Chebyshev functions. Then, a numerical algorithm based on Chebyshev polynomials is presented for obtaining the solution of the problem. For solving the problem, the operational matrices of int...
متن کامل3 A pr 2 01 3 On the Two Conjectures of the Wiener Index ∗
The Wiener index of a graph, which is the sum of the distances between all pairs of vertices, has been well studied. Recently, Sills and Wang in 2012 proposed two conjectures on the maximal Wiener index of trees with a given degree sequence. This note proves one of the two conjectures and disproves the other.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Discrete Math.
دوره 17 شماره
صفحات -
تاریخ انتشار 2003